The on-line Heilbronn's triangle problem
نویسندگان
چکیده
منابع مشابه
Schwarz boundary problem on a triangle
In this paper, the Schwarz boundary value problem (BVP) for the inhomogeneous Cauchy-Riemann equation in a triangle is investigated explicitly. Firstly, by the technique of parquetingreflection and the Cauchy-Pompeiu representation formula a modified Cauchy-Schwarz representation formula is obtained. Then, the solution of the Schwarz BVP is explicitly solved. In particular, the boundary behavio...
متن کاملOn Heilbronn's Triangle Problem
Let PuP2,...,Pn be a distribution of n points (where n ^ 3) in a closed convex region K of unit area such that the minimum of the areas of the triangles PjPjPk (taken over all selections of three out of n points) assumes its maximum possible value A(/C ; n). We write A(n) = A(D ; n) if D is a disc. Heilbronn conjectured over 30 years ago that A(n) « n~, where A « B means A ^ cB with an absolute...
متن کاملOn the Tweety Penguin Triangle Problem
In this paper, one studies the famous well-known and challenging Tweety Penguin Triangle Problem (TPTP or TP2) pointed out by Judea Pearl in one of his books. We first present the solution of the TP2 based on the fallacious Bayesian reasoning and prove that reasoning cannot be used to conclude on the ability of the penguin-bird Tweety to fly or not to fly. Then we present in details the counter...
متن کاملThe triangle scheduling problem
This paper introduces a novel scheduling problem, where jobs occupy a triangular shape on the time line. This problem is motivated by scheduling jobs with different criticality levels. A measure is introduced, namely the binary tree ratio. It is shown that the greedy algorithm solves the problem to optimality when the binary tree ratio is at most 2. We also show that the problem is unary NP-har...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2004
ISSN: 0012-365X
DOI: 10.1016/j.disc.2004.03.001